LrgpV1, Main, Exploration, bibRecord, 001875

Receding horizon iterative dynamic programming with discrete time models

Identifieur interne : 001875 ( Main/Exploration ); précédent : 001874; suivant : 001876

Receding horizon iterative dynamic programming with discrete time models

Auteurs : A. Rusnák [Slovaquie] ; M. Fikar [Slovaquie] ; M. A. Latifi [France] ; A. Mészáros [Slovaquie]

Source :

Computers and Chemical Engineering [ 0098-1354 ] ; 2001.

RBID : ISTEX:7FA5878289C1EF94CEE4AA0F2E49348F19A3CAEB

Descripteurs français

Wicri :
- topic : Simulation.

English descriptors

Abstract

Abstract: This contribution proposes a modified version of the Iterative Dynamic Programming (IDP) method. Two main differences to the original method are introduced. The new algorithm deals with discrete-time input–output models compared to continuous-time state–space models described by a set of ODE/DAE used in the original method. The main purpose of these modifications is to reduce computational load of the original method, estimate the process models more easily, and to enable its use on-line in receding horizon predictive control framework.

Url:

https://api.istex.fr/document/7FA5878289C1EF94CEE4AA0F2E49348F19A3CAEB/fulltext/pdf

DOI: 10.1016/S0098-1354(00)00639-6

Affiliations:

Links toward previous steps (curation, corpus...)

to stream Istex, to step Corpus: 001259
to stream Istex, to step Curation: 001259
to stream Istex, to step Checkpoint: 000538
to stream Main, to step Merge: 001B50
to stream Main, to step Curation: 001875

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Receding horizon iterative dynamic programming with discrete time models</title>
<author><name sortKey="Rusnak, A" sort="Rusnak, A" uniqKey="Rusnak A" first="A." last="Rusnák">A. Rusnák</name>
</author>
<author><name sortKey="Fikar, M" sort="Fikar, M" uniqKey="Fikar M" first="M." last="Fikar">M. Fikar</name>
</author>
<author><name sortKey="Latifi, M A" sort="Latifi, M A" uniqKey="Latifi M" first="M. A." last="Latifi">M. A. Latifi</name>
</author>
<author><name sortKey="Meszaros, A" sort="Meszaros, A" uniqKey="Meszaros A" first="A." last="Mészáros">A. Mészáros</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:7FA5878289C1EF94CEE4AA0F2E49348F19A3CAEB</idno>
<date when="2001" year="2001">2001</date>
<idno type="doi">10.1016/S0098-1354(00)00639-6</idno>
<idno type="url">https://api.istex.fr/document/7FA5878289C1EF94CEE4AA0F2E49348F19A3CAEB/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001259</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001259</idno>
<idno type="wicri:Area/Istex/Curation">001259</idno>
<idno type="wicri:Area/Istex/Checkpoint">000538</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000538</idno>
<idno type="wicri:doubleKey">0098-1354:2001:Rusnak A:receding:horizon:iterative</idno>
<idno type="wicri:Area/Main/Merge">001B50</idno>
<idno type="wicri:Area/Main/Curation">001875</idno>
<idno type="wicri:Area/Main/Exploration">001875</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Receding horizon iterative dynamic programming with discrete time models</title>
<author><name sortKey="Rusnak, A" sort="Rusnak, A" uniqKey="Rusnak A" first="A." last="Rusnák">A. Rusnák</name>
<affiliation wicri:level="1"><country xml:lang="fr">Slovaquie</country>
<wicri:regionArea>Department of Process Control, CHTF STU, Radlinského 9, SK-812 37 Bratislava</wicri:regionArea>
<wicri:noRegion>SK-812 37 Bratislava</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Fikar, M" sort="Fikar, M" uniqKey="Fikar M" first="M." last="Fikar">M. Fikar</name>
<affiliation wicri:level="1"><country xml:lang="fr">Slovaquie</country>
<wicri:regionArea>Department of Process Control, CHTF STU, Radlinského 9, SK-812 37 Bratislava</wicri:regionArea>
<wicri:noRegion>SK-812 37 Bratislava</wicri:noRegion>
</affiliation>
<affiliation></affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Slovaquie</country>
</affiliation>
</author>
<author><name sortKey="Latifi, M A" sort="Latifi, M A" uniqKey="Latifi M" first="M. A." last="Latifi">M. A. Latifi</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>Laboratoire des Sciences du Génie Chimique, CNRS-ENSIC, B.P. 451, 1 rue Grandville, 54001 Nancy Cedex</wicri:regionArea>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Nancy</settlement>
</placeName>
</affiliation>
<affiliation></affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Meszaros, A" sort="Meszaros, A" uniqKey="Meszaros A" first="A." last="Mészáros">A. Mészáros</name>
<affiliation wicri:level="1"><country xml:lang="fr">Slovaquie</country>
<wicri:regionArea>Department of Process Control, CHTF STU, Radlinského 9, SK-812 37 Bratislava</wicri:regionArea>
<wicri:noRegion>SK-812 37 Bratislava</wicri:noRegion>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="j">Computers and Chemical Engineering</title>
<title level="j" type="abbrev">CACE</title>
<idno type="ISSN">0098-1354</idno>
<imprint><publisher>ELSEVIER</publisher>
<date type="published" when="2001">2001</date>
<biblScope unit="volume">25</biblScope>
<biblScope unit="issue">1</biblScope>
<biblScope unit="page" from="161">161</biblScope>
<biblScope unit="page" to="167">167</biblScope>
</imprint>
<idno type="ISSN">0098-1354</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0098-1354</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm</term>
<term>Biochemical reactor</term>
<term>Chem</term>
<term>Chemical engineering</term>
<term>Computational load</term>
<term>Control action</term>
<term>Control actions</term>
<term>Control move</term>
<term>Control region</term>
<term>Control trajectories</term>
<term>Control trajectory</term>
<term>Cost function</term>
<term>Dilution rate</term>
<term>Discrete-time models</term>
<term>Distillation column</term>
<term>Dynamic optimisation</term>
<term>Dynamic optimization</term>
<term>Dynamic programming</term>
<term>Elsevier science</term>
<term>Execution times</term>
<term>Horizon formulation</term>
<term>Initial size</term>
<term>Input output models</term>
<term>Iteration</term>
<term>Iteration index</term>
<term>Iterative</term>
<term>Iterative dynamic programming</term>
<term>Last stage</term>
<term>Luus</term>
<term>Optimal control</term>
<term>Optimal control trajectory</term>
<term>Original method</term>
<term>Output trajectories</term>
<term>Performance index</term>
<term>Prediction horizon</term>
<term>Predictive control</term>
<term>Predictor</term>
<term>Process model</term>
<term>Process output</term>
<term>Rusnak</term>
<term>Sampling time</term>
<term>Second example</term>
<term>Simulation</term>
<term>Trajectory</term>
</keywords>
<keywords scheme="Teeft" xml:lang="en"><term>Algorithm</term>
<term>Biochemical reactor</term>
<term>Chem</term>
<term>Chemical engineering</term>
<term>Computational load</term>
<term>Control action</term>
<term>Control actions</term>
<term>Control move</term>
<term>Control region</term>
<term>Control trajectories</term>
<term>Control trajectory</term>
<term>Cost function</term>
<term>Dilution rate</term>
<term>Distillation column</term>
<term>Dynamic optimisation</term>
<term>Dynamic optimization</term>
<term>Dynamic programming</term>
<term>Elsevier science</term>
<term>Execution times</term>
<term>Horizon formulation</term>
<term>Initial size</term>
<term>Input output models</term>
<term>Iteration</term>
<term>Iteration index</term>
<term>Iterative</term>
<term>Last stage</term>
<term>Luus</term>
<term>Optimal control</term>
<term>Optimal control trajectory</term>
<term>Original method</term>
<term>Output trajectories</term>
<term>Performance index</term>
<term>Prediction horizon</term>
<term>Predictive control</term>
<term>Predictor</term>
<term>Process model</term>
<term>Process output</term>
<term>Rusnak</term>
<term>Sampling time</term>
<term>Second example</term>
<term>Simulation</term>
<term>Trajectory</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Simulation</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: This contribution proposes a modified version of the Iterative Dynamic Programming (IDP) method. Two main differences to the original method are introduced. The new algorithm deals with discrete-time input–output models compared to continuous-time state–space models described by a set of ODE/DAE used in the original method. The main purpose of these modifications is to reduce computational load of the original method, estimate the process models more easily, and to enable its use on-line in receding horizon predictive control framework.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
<li>Slovaquie</li>
</country>
<region><li>Grand Est</li>
<li>Lorraine (région)</li>
</region>
<settlement><li>Nancy</li>
</settlement>
</list>
<tree><country name="Slovaquie"><noRegion><name sortKey="Rusnak, A" sort="Rusnak, A" uniqKey="Rusnak A" first="A." last="Rusnák">A. Rusnák</name>
</noRegion>
<name sortKey="Fikar, M" sort="Fikar, M" uniqKey="Fikar M" first="M." last="Fikar">M. Fikar</name>
<name sortKey="Fikar, M" sort="Fikar, M" uniqKey="Fikar M" first="M." last="Fikar">M. Fikar</name>
<name sortKey="Meszaros, A" sort="Meszaros, A" uniqKey="Meszaros A" first="A." last="Mészáros">A. Mészáros</name>
</country>
<country name="France"><region name="Grand Est"><name sortKey="Latifi, M A" sort="Latifi, M A" uniqKey="Latifi M" first="M. A." last="Latifi">M. A. Latifi</name>
</region>
<name sortKey="Latifi, M A" sort="Latifi, M A" uniqKey="Latifi M" first="M. A." last="Latifi">M. A. Latifi</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/LrgpV1/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001875 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001875 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    LrgpV1
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:7FA5878289C1EF94CEE4AA0F2E49348F19A3CAEB
   |texte=   Receding horizon iterative dynamic programming with discrete time models
}}

This area was generated with Dilib version V0.6.32.
Data generation: Sat Nov 11 15:47:48 2017. Site generation: Wed Mar 6 23:31:34 2024

	Serveur d'exploration sur le LRGP
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur le LRGP

Receding horizon iterative dynamic programming with discrete time models

Receding horizon iterative dynamic programming with discrete time models

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri